Interpolating between Hilbert–Samuel and Hilbert–Kunz multiplicity
نویسندگان
چکیده
منابع مشابه
Interpolating between random walk and rotor walk
We introduce a family of stochastic processes on the integers, depending on a parameter p ∈ [0, 1] and interpolating between the deterministic rotor walk (p = 0) and the simple random walk (p = 1/2). This p-rotor walk is not a Markov chain but it has a local Markov property: for each x ∈ Z the sequence of successive exits from x is a Markov chain. The main result of this paper identifies the sc...
متن کاملInterpolating Between Quantum and Classical Complexity Classes
We reveal a natural algebraic problem whose complexity appears to interpolate between the well-known complexity classes BQP and NP: ⋆ Decide whether a univariate polynomial with exactly m monomial terms has a p-adic rational root. In particular, we show that while (⋆) is doable in quantum randomized polynomial time when m=2 (and no classical randomized polynomial time algorithm is known), (⋆) i...
متن کاملInterpolating Between Topologies: Casimir Energies
A set of models is considered which, in a certain sense, interpolates between 1+1 free quantum field theories on topologically distinct backgrounds. The intermediate models may be termed free quantum field theories, though they are certainly not local. Their ground state energies are computed and shown to be finite. The possible relevance to changing spacetime topologies is discussed.
متن کاملEigenvalues of neutral networks: Interpolating between hypercubes
A neutral network is a subgraph of a Hamming graph, and its principal eigenvalue determines its robustness: the ability of a population evolving on it to withstand errors. Here we consider the most robust small neutral networks: the graphs that interpolate pointwise between hypercube graphs of consecutive dimension (the point, line, line and point in the square, square, square and point in the ...
متن کاملInterpolating between bounds on the independence number
For a non-negative integer T , we prove that the independence number of a graph G = (V,E) in which every vertex belongs to at most T triangles is at least ∑ u∈V f(d(u), T ) where d(u) denotes the degree of a vertex u ∈ V , f(d, T ) = 1 d+1 for T ≥ ( d 2 ) and f(d, T ) = (1 + (d2− d− 2T )f(d− 1, T ))/(d2 + 1− 2T ) for T < ( d 2 ) . This is a common generalization of the lower bounds for the inde...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2018
ISSN: 0021-8693
DOI: 10.1016/j.jalgebra.2018.05.015